A Pumping Lemma for Homometric Rhythms

نویسندگان

  • Joseph O'Rourke
  • Perouz Taslakian
  • Godfried T. Toussaint
چکیده

Homometric rhythms (chords) are those with the same histogram or multiset of intervals (distances). The purpose of this note is threefold. First, to point out the potential importance of isospectral vertices in a pair of homometric rhythms. Second, to establish a method (“pumping”) for generating an infinite sequence of homometric rhythms that include isospectral vertices. And finally, to introduce the notion of polyphonic homometric rhythms, which apparently have not been previously explored.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

The Continuous Hexachordal Theorem

The Hexachordal Theorem may be interpreted in terms of scales, or rhythms, or as abstract mathematics. In terms of scales it claims that the complement of a chord that uses half the pitches of a scale is homometric to—i.e., has the same interval structure as—the original chord. In terms of onsets it claims that the complement of a rhythm with the same number of beats as rests is homometric to t...

متن کامل

A Proof of the Pumping Lemma for Context-Free Languages Through Pushdown Automata

The pumping lemma for context-free languages is a result about pushdown automata which is strikingly similar to the well-known pumping lemma for regular languages. However, though the lemma for regular languages is simply proved by using the pigeonhole principle on deterministic automata, the lemma for pushdown automata is proven through an equivalence with context-free languages and through th...

متن کامل

Pumping Lemma and Ogden Lemma for Displacement Context-Free Grammars

The pumping lemma and Ogden lemma offer a powerful method to prove that a particular language is not context-free. In 2008 Kanazawa proved an analogue of pumping lemma for well-nested multiplecontext free languages. However, the statement of lemma is too weak for practical usage. We prove a stronger variant of pumping lemma and an analogue of Ogden lemma for the class of tree-adjoining language...

متن کامل

A Pumping Lemma for Collapsible Pushdown Graphs of Level 2

We present a pumping lemma for the class of collapsible pushdown graphs of level 2. This pumping lemma even applies to the ε-contractions of level 2 collapsible pushdown graphs. Our pumping lemma also improves the bounds of Hayashi’s pumping lemma for indexed languages. 1998 ACM Subject Classification F.1.1 Models of Computation

متن کامل

Pumping Lemma for Higher-order Languages

We study a pumping lemma for the word/tree languages generated by higher-order grammars. Pumping lemmas are known up to order-2 word languages (i.e., for regular/context-free/indexed languages), and have been used to show that a given language does not belong to the classes of regular/context-free/indexed languages. We prove a pumping lemma for word/tree languages of arbitrary orders, modulo a ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2008